Binary codes from graphs on triples
نویسندگان
چکیده
For a set Ω of size n ≥ 7 and Ω{3} the set of subsets of Ω of size 3, we examine the binary codes obtained from the adjacency matrix of each of the three graphs with vertex set Ω{3}, with adjacency defined by two vertices as 3-sets being adjacent if they have zero, one or two elements in common, respectively.
منابع مشابه
Binary codes from graphs on triples and permutation decoding
We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on ` n 3 ́ vertices, for n ≥ 7, with adjacency defined by the vertices as 3-sets being adjacent if they have zero, one or two elements in common, respectively.
متن کاملComputing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملAsteroidal number for some product graphs
The notion of Asteroidal triples was introduced by Lekkerkerker and Boland [6]. D.G.Corneil and others [2], Ekkehard Kohler [3] further investigated asteroidal triples. Walter generalized the concept of asteroidal triples to asteroidal sets [8]. Further study was carried out by Haiko Muller [4]. In this paper we find asteroidal numbers for Direct product of cycles, Direct product of path and cy...
متن کاملBinary Codes of Strongly Regular Graphs
For strongly regular graphs with adjacency matrix A, we look at the binary codes generated by A and A+ I . We determine these codes for some families of graphs, we pay attention to the relation between the codes of switching equivalent graphs and, with the exception of two parameter sets, we generate by computer the codes of all known strongly regular graphs on fewer than 45 vertices.
متن کاملNew extremal binary self-dual codes of lengths 64 and 66 from bicubic planar graphs
Abstract. In this work, connected cubic planar bipartite graphs and related binary self-dual codes are studied. Binary self-dual codes of length 16 are obtained by face-vertex incidence matrices of these graphs. By considering their lifts to the ring R2 new extremal binary self-dual codes of lengths 64 are constructed as Gray images. More precisely, we construct 15 new codes of length 64. Moreo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 282 شماره
صفحات -
تاریخ انتشار 2004